منابع مشابه
Favourite sites of simple random walk
We survey the current status of the list of questions related to the favourite (or: most visited) sites of simple random walk on Z, raised by Pál Erdős and Pál Révész in the early eighties.
متن کاملIn vitro and in vivo examinations of metabolic transformation of capsaicinoids and salicylates
s 1. Kuzma Mónika, Molnár Szilárd, Perjési Pál: Szalicilsav Fenton-reakcióval történő oxidációjának vizsgálata. Congressus Pharmaceuticus Hungaricus XIII., Budapest, 2006. május 25-27. Gyógyszerészet (kongresszusi különszám) 2006, p. 67. 2. Perjési Pál, Kuzma Mónika, Fodor Krisztina, Rozmer Zsuzsanna: Application of crocin bleaching and deoxyribose degradation tests to assess antioxidant capaci...
متن کاملA Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem: (Extended Abstract)
We present a multi-exchange local search algorithm for approximating the capacitated facility location problem (CFLP), where a new local improvement operation is introduced that possibly exchanges multiple facilities simultaneously. We give a tight analysis for our algorithm and show that the performance guarantee of the algorithm is between 3+2 √ 2− 2 and 3+2√2+ 2 for any given constant 2 > 0....
متن کاملOn the LP Relaxation of the Asymmetric Traveling Salesman Path Problem
This is a comment on the article “An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem” by C. Chekuri and M. Pál, Theory of Computing 3 (2007), 197–209. We observe that the LP relaxation for the Asymmetric Traveling Salesman Path Problem suggested in Section 5 of that paper is not accurate, and state a corrected linear relaxation for the problem. The inaccuracy occu...
متن کاملA Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
We present a multiexchange local search algorithm for approximating the capacitated facility location problem (CFLP), where a new local improvement operation is introduced that possibly exchanges multiple facilities simultaneously. We give a tight analysis for our algorithm and show that the performance guarantee of the algorithm is between 3+ 2√2− and 3+ 2√2+ for any given constant > 0. The pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Agrokémia és Talajtan
سال: 2016
ISSN: 0002-1873,1588-2713
DOI: 10.1556/0088.2016.65.2.1